A quasi-linear algorithm for calculating the infimal convolution of convex quadratic functions
نویسندگان
چکیده
In this paper we present an algorithm of quasi-linear complexity for exactly calculating the infimal convolution of convex quadratic functions. The algorithm exactly and simultaneously solves a separable uniparametric family of quadratic programming problems resulting from varying the equality constraint.
منابع مشابه
Some Results on Convex Spectral Functions: I
In this paper, we give a fundamental convexity preserving for spectral functions. Indeed, we investigate infimal convolution, Moreau envelope and proximal average for convex spectral functions, and show that this properties are inherited from the properties of its corresponding convex function. This results have many applications in Applied Mathematics such as semi-definite programmings and eng...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS On Infimal Convolution of M-Convex Functions
The infimal convolution of M-convex functions is M-convex. This is a fundamental fact in discrete convex analysis that is often useful in its application to mathematical economics and game theory. M-convexity and its variant called M-convexity are closely related to gross substitutability, and the infimal convolution operation corresponds to an aggregation. This note provides a succinct descrip...
متن کاملOrder and type as measures of growth for convex or entire functions
1. Introduction 2. Order and type in classical complex analysis 3. Relative order and type of convex functions 4. Order and type in duality 5. The infimal convolution 6. The order of an entire function 7. A geometric characterisation of the relative order 8. An extension problem for holomorphic functions 9. Whittaker's decomposition theorem 10. Inequalities for the infimal convolution 11. Inequ...
متن کاملAn Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...
متن کاملOptimal Decomposition in Real Interpolation and Duality in Convex Analysis
This thesis is devoted to the study of mathematical properties of exact minimizers for the K–,L–, and E– functionals of the theory of real interpolation. Recently exact minimizers for these functionals have appeared in important results in image processing. In the thesis, we present a geometry of optimal decomposition for L– functional for the couple (`2, X), where space `2 is defined by the st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Computational Applied Mathematics
دوره 236 شماره
صفحات -
تاریخ انتشار 2012